Integer factorization algorithms

Results: 208



#Item
71The Extended Euclidean Algorithm Example 1: m = 65, n = 40 Step 1: The (usual) Euclidean algorithm: ([removed])

The Extended Euclidean Algorithm Example 1: m = 65, n = 40 Step 1: The (usual) Euclidean algorithm: ([removed])

Add to Reading List

Source URL: www.mast.queensu.ca

Language: English - Date: 2006-01-13 12:22:55
72From: [removed]:29 To: [removed]:29 Print Date: [removed]Arrest/Release Report  Page:

From: [removed]:29 To: [removed]:29 Print Date: [removed]Arrest/Release Report Page:

Add to Reading List

Source URL: media.graytvinc.com

Language: English - Date: 2013-09-17 09:30:38
73Name _____________________________________________________________________________________________________  Prime Factorization R 7-2

Name _____________________________________________________________________________________________________ Prime Factorization R 7-2

Add to Reading List

Source URL: pleasanton.k12.ca.us

Language: English - Date: 2004-01-30 15:22:30
74Name _____________________________________________________________________________________________________  Common Factors and GCF R 7-3

Name _____________________________________________________________________________________________________ Common Factors and GCF R 7-3

Add to Reading List

Source URL: pleasanton.k12.ca.us

Language: English - Date: 2004-01-30 15:23:28
75From: [removed]:39 To: [removed]:39 Print Date: [removed]Arrest/Release Report  Page:

From: [removed]:39 To: [removed]:39 Print Date: [removed]Arrest/Release Report Page:

Add to Reading List

Source URL: media.graytvinc.com

Language: English - Date: 2013-03-04 10:23:45
76The Function Field Sieve in the Medium Prime Case Antoine Joux1,3 and Reynald Lercier1,2 1  DGA

The Function Field Sieve in the Medium Prime Case Antoine Joux1,3 and Reynald Lercier1,2 1 DGA

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2008-09-15 00:54:53
77Roots of Polynomials in Subgroups of F∗p and Applications to Congruences Enrico Bombieri, Jean Bourgain, Sergei Konyagin IAS, Princeton, IAS Princeton, Moscow State University

Roots of Polynomials in Subgroups of F∗p and Applications to Congruences Enrico Bombieri, Jean Bourgain, Sergei Konyagin IAS, Princeton, IAS Princeton, Moscow State University

Add to Reading List

Source URL: www.fields.utoronto.ca

Language: English - Date: 2008-11-03 09:49:23
78On Class Group Computations Using the Number Field Sieve Mark L. Bauer1 and Safuat Hamdy2 1  University of Waterloo

On Class Group Computations Using the Number Field Sieve Mark L. Bauer1 and Safuat Hamdy2 1 University of Waterloo

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2008-09-15 00:54:54
79Factoring estimates for a 1024-bit RSA modulus Arjen Lenstra1 , Eran Tromer2 , Adi Shamir2 , Wil Kortsmit3 , Bruce Dodson4 , James Hughes5 , Paul Leyland6 1  Citibank, N.A. and Technische Universiteit Eindhoven,

Factoring estimates for a 1024-bit RSA modulus Arjen Lenstra1 , Eran Tromer2 , Adi Shamir2 , Wil Kortsmit3 , Bruce Dodson4 , James Hughes5 , Paul Leyland6 1 Citibank, N.A. and Technische Universiteit Eindhoven,

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2008-09-15 00:54:54
80SHARK A Realizable Special Hardware Sieving Device for Factoring 1024-bit Integers Jens Franke1 , Thorsten Kleinjung1 , Christof Paar2 , Jan Pelzl2 , Christine Priplata3 , and Colin Stahlke3 1

SHARK A Realizable Special Hardware Sieving Device for Factoring 1024-bit Integers Jens Franke1 , Thorsten Kleinjung1 , Christof Paar2 , Jan Pelzl2 , Christine Priplata3 , and Colin Stahlke3 1

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2008-09-15 00:54:55